#include <bits/stdc++.h>
using namespace std;
const int nex[8] = {1, 2, 3, 4, 5, 6, 7, 1};
deque<int> D;
deque<int> P[8];
set<vector<deque<int> > > buff;

bool check(int p){
    if(P[p].size()<3) return false;
    int last = (int)P[p].size()-1;
    int first = P[p][0] + P[p][1] + P[p][last];
    int second = P[p][0] + P[p][last-1] + P[p][last];
    int third = P[p][last-2] + P[p][last-1] + P[p][last];

    if(first == 10 || first == 20 || first == 30){
        D.push_back(P[p][0]); D.push_back(P[p][1]); D.push_back(P[p][last]);
        P[p].pop_back(); P[p].erase(P[p].begin(), P[p].begin()+2);
        return true;
    }
    else if(second == 10 || second == 20 || second == 30){
        D.push_back(P[p][0]); D.push_back(P[p][last-1]); D.push_back(P[p][last]);
        P[p].pop_back(); P[p].pop_back(); P[p].erase(P[p].begin());
        return true;
    }
    else if(third == 10 || third == 20 || third == 30){
        D.push_back(P[p][last-2]); D.push_back(P[p][last-1]); D.push_back(P[p][last]);
        P[p].erase(P[p].end()-3, P[p].end());
        return true;
    }
    return false;
}


bool draw(){
    vector<deque<int> >t;
    for (int i = 1; i <= 7; ++i) {
        t.push_back(P[i]);
    }
    t.push_back(D);
    if(buff.count(t)) return true;
    else buff.insert(t);
    return false;
}
void init(){
    while(!D.empty()) D.pop_front();
    for (int i = 1; i <= 7; ++i) {
        P[i].clear();
    }
    buff.clear();

}
int main() {
    //ios_base::sync_with_stdio(false);cin.tie(nullptr);
    int in;
    while(cin >> in && in){
        init();
        D.push_back(in);
        for (int i = 0; i < 51; ++i) {
            cin >> in; D.push_back(in);
        }
        draw();
        for (int j = 0; j < 2; ++j) {
            for (int i = 1; i <= 7; ++i) {
                P[i].push_back(D.front());
                D.pop_front();
                draw();
            }
        }

        int cnt = 14;
        int final = -1;
        int p = 0, cntPile = 7;
        while(!D.empty()){
            ++cnt;
            int t = D.front(); D.pop_front();
            p = nex[p];
            while(P[p].empty()) p = nex[p];

            P[p].push_back(t);
            while(check(p)) check(p);

            if(P[p].empty()) --cntPile;
            if(!cntPile) {final = 1; break;}
            if(draw()) {final = 2; break;}

        }
        if(final == 1) cout << "Win : " << cnt << "\n";
        else if(final == 2) cout << "Draw: " << cnt << '\n';
        else cout << "Loss: " << cnt << "\n";
    }
    return 0;
}